Interval Graphs: Canonical Representation in Logspace
نویسندگان
چکیده
We present a logspace algorithm for computing a canonical interval representation and a canonical labeling of interval graphs. As a consequence, the isomorphism and automorphism problems for interval graphs are solvable in logspace.
منابع مشابه
Interval Graphs: Canonical Representations in Logspace
We present a logspace algorithm for computing a canonical labeling, in fact a canonical interval representation, for interval graphs. To achieve this, we compute canonical interval representations of interval hypergraphs. This approach also yields a canonical labeling of convex graphs. As a consequence, the isomorphism and automorphism problems for these graph classes are solvable in logspace. ...
متن کاملHelly Circular-Arc Graph Isomorphism Is in Logspace
We present logspace algorithms for the canonical labeling problem and the representation problem of Helly circular-arc (HCA) graphs. The first step is a reduction to canonical labeling and representation of interval intersection matrices. In a second step, the Δ trees employed in McConnell’s linear time representation algorithm for interval matrices are adapted to the logspace setting and endow...
متن کاملSolving the Canonical Representation and Star System Problems for Proper Circular-Arc Graphs in Logspace
We present a logspace algorithm that constructs a canonical intersection model for a given proper circular-arc graph, where canonical means that models of isomorphic graphs are equal. This implies that the recognition and the isomorphism problems for this class of graphs are solvable in logspace. For a broader class of concave-round graphs, that still possess (not necessary proper) circular-arc...
متن کاملDeciding Circular-Arc Graph Isomorphism in Parameterized Logspace
We compute a canonical circular-arc representation for a given circular-arc (CA) graph which implies solving the isomorphism and recognition problem for this class. To accomplish this we split the class of CA graphs into uniform and non-uniform ones and employ a generalized version of the argument given by Köbler et al. (2013) that has been used to show that the subclass of Helly CA graphs can ...
متن کاملInterval Graph Representation with Given Interval and Intersection Lengths
We consider the problem of finding interval representations of graphs that additionally respect given interval lengths and/or pairwise intersection lengths, which are represented as weight functions on the vertices and edges, respectively. Pe’er and Shamir proved that the problem is NP-complete if only the former are given [SIAM J. Discr. Math. 10.4, 1997]. We give both a linear-time and a logs...
متن کامل